Unsupervised Object Ranking Using Not Even Weak Experts
نویسندگان
چکیده
Many problems, like feature selection, involve evaluating objects while ignoring the relevant underlying properties that determine their true value. Generally, an heuristic evaluating device (e.g. filter, wrapper, etc) is then used with no guarantee on the result. We show in this paper how a set of experts (evaluation function of the objects), not even necessarily weakly positively correlated with the unknown ideal expert, can be used to dramatically improve the accuracy of the selection of positive objects, or of the resulting ranking. Experimental results obtained on both synthetic and real data confirm the validity of the approach. General lessons and possible extensions are discussed.
منابع مشابه
Fast Unsupervised Automobile Insurance Fraud Detection Based on Spectral Ranking of Anomalies
Collecting insurance fraud samples is costly and if performed manually is very time consuming. This issue suggests usage of unsupervised models. One of the accurate methods in this regards is Spectral Ranking of Anomalies (SRA) that is shown to work better than other methods for auto insurance fraud detection specifically. However, this approach is not scalable to large samples and is not appro...
متن کاملDetecting unnatural motion with Epitomic analysis : Unsupervised learning
Motion synthesis and creation are crucial issues in animation. Synthesizing and creating motions of complex objects such as articulated joints of humans have been challenging problems. The traditional way to produce human motion is for experts to specify the poses of movements at each instant time. The limitations of manual specification require not only a great amount of labors but also expert...
متن کاملRanking Aggregation Based on Belief Function Theory
The ranking aggregation problem is that to establishing a new aggregate ranking given a set of rankings of a finite set of items. This problem is met in various applications, such as the combination of user preferences, the combination of lists of documents retrieved by search engines and the combination of ranked gene lists. In the literature, the ranking aggregation problem has been solved as...
متن کاملEvaluating several unsupervised class-selection methods
In knowledge discovery from collected databases, one of the firstly arising questions is ”what should be discovered”. Two lines of work can be followed. In the first line, unsupervised learning is performed, usually clustering data, followed by a characterization of the discovered knowledge. In the second line, classifiers are constructed for each highly important feature registered in the data...
متن کاملCombining Summaries Using Unsupervised Rank Aggregation
We model the problem of combining multiple summaries of a given document into a single summary in terms of the well-known rank aggregation problem. Treating sentences in the document as candidates and summarization algorithms as voters, we determine the winners in an election where each voter selects and ranks k candidates in order of its preference. Many rank aggregation algorithms are supervi...
متن کامل